A Class of Hypercube-Like Networks
نویسندگان
چکیده
W e introduce a class of graphs which are variants of t h e hypercube graph. M a n y of the properties of this class of graphs are s imilar t o tha t of the hypercube hence, we refer t o t h e m as t h e class of Hypercube-Like ( H L ) graphs/networks. W e show that the hypercube, t h e twisted n-cube [l] and the multiply-twisted cube [2] are members of this class of graphs. W e also propose s imple strategies f o r distributed m u t i n g and broadcast and discuss s o m e issues regarding embedding other graphs and reconfiguration in such networks.
منابع مشابه
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
In this paper, we study the Menger property on a class of hypercube-like networks. We show that in all n-dimensional hypercubelike networks with n − 2 vertices removed, every pair of unremoved vertices u and v are connected by min{deg(u),deg(v)} vertex-disjoint paths, where deg(u) and deg(v) are the remaining degree of vertices u and v, respectively. Furthermore, under the restricted condition ...
متن کاملHypercube Bivariate-Based Key Management for Wireless Sensor Networks
Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous k...
متن کاملFault-Tolerant Cycle Embedding in Restricted Hypercube-like Networks with More Faulty Nodes
The hypercube-like networks are a class of important generalization of the popular hypercube interconnection networks for parallel computing. This paper is concerned with the fault-tolerant cycle embedding ability of a subclass of hypercube-like networks, called restricted hypercube-like networks (RHLNs, for short), which include most of the well-known hypercube variants, such as the twisted cu...
متن کاملProperties and Embedding of Interconnection Networks Based on the hexcube
A new class of interconnection networks called the hexcube is proposed. The hexcube is similar to the base-6 generalized hypercube in structure but has a simpler interconnection scheme. The present work shows that the hexcube is vertex symmetric and possesses topological properties similar to those of the hypercube. This implies that the costs of building parallel computers using the hexcube an...
متن کاملPanconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements
In this paper, we deal with the graph G0⊕G1 obtained from merging two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1. The main problems studied are how fault-panconnectivity and fault-pancyclicity of G0 and G1 are translated into fault-panconnectivity and fault-pancyclicity of G0⊕G1, respectively. Many interconnection networks suc...
متن کامل